Analysis of Meta-level Communication for Distributed Resource Allocation Problems
نویسندگان
چکیده
We examine the effects of meta-level-communication in the DSRAP (Distributed Sequential Resource Allocation Problem). In DSRAP, independent tasks are categorized into different types, where each task belonging to a particular task type shares a known distribution of task arrivals, durations, reward rates, maximum waiting times, and resource demands. We first look at a single task type DSRAP (SDSRAP) and develop an analytical model of the effect of metalevel communication about load on system performance for first-in-first-out (FIFO) local scheduling agents that forward tasks based on load. Through our analytical models and empirical results, we show how the frequency of communication affects performance for SDSRAP problems with one resource and task type. We then quantitatively measure the impact of meta-level communication on system performance with respect to the global measures of the system’s load balance. We validate our analytical model’s predictions experimentally, showing, e.g., as system load becomes unbalanced, performance decreases; organizational structure significantly impacts agent performance; and agents that can communicate and distribute tasks to neighbors significantly outperform agents working individually. Through our analysis on FIFO, routing algorithms, and our policy agents, we provide a framework for analyzing more complex task schedulers and task routing algorithms.
منابع مشابه
Hybrid Meta-heuristic Algorithm for Task Assignment Problem
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...
متن کاملMeta-Reasoning For a Distributed Agent Architecture
Agent based computing offers the ability to decentralize computing solutions by incorporating autonomy and intelligence into cooperating, distributed applications. It provides an effective medium for expressing solutions to problems that involve interaction with real-world environments and allows modelling of the world state and its dynamics. This model can be then used to determine how candida...
متن کاملA Bi-level Formulation for Centralized Resource Allocation DEA Models
In this paper, the common centralized DEA models are extended to the bi-level centralized resource allocation (CRA) models based on revenue efficiency. Based on the Karush–Kuhn–Tucker (KKT) conditions, the bi-level CRA model is reduced to a one-level mathematical program subject to complementarity constraints (MPCC). A recurrent neural network is developed for solving this one-level mathematica...
متن کاملA Distributed Algorithm for Resource Allocation with Probabilistic Quorum Systems
The resource allocation problem is one of fundamental problems in distributed systems, and many resource models and resource allocation algorithms have been proposed in many literature. In this paper, we consider a problem of allocating a set of unnamed resources that can be overbooked. Such a resource model is suitable for sharing broadband communication channel by many nodes. We propose a ran...
متن کاملCommunication Complexity of Distributed Resource Allocation Optimization
This paper investigates the communication complexity of distributed resource allocation problems. Communication complexity, which has emerged from computer science, measures the minimal number of communicated bits needed to solve some classes of problems regardless of the used algorithm, when the communication is lossless. We introduce two complexity measures for finding primal/dual saddle poin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017